A Survey on Methods and Systems for Graph Compression
نویسندگان
چکیده
We present an informal survey (meant to accompany another paper) on graph compression methods. We focus on lossless methods, briefly list available approaches, and compare them where possible or give some indicators on their compression ratios. We also mention some relevant results from the field of lossy compression and algorithms specialized for the use on large graphs. — Note: The comparison is by no means complete. This document is a first draft and will be updated and extended.
منابع مشابه
Implementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملMEDICAL IMAGE COMPRESSION: A REVIEW
Within recent years the use of medical images for diagnosis purposes has become necessity. The limitation in transmission and storage space also growing size of medical images has necessitated the need for efficient method, then image Compression is required as an efficient way to reduces irrelevant and redundancy of the image data in order to be able to store or transmits data. It also reduces...
متن کاملA survey of the studies on Gallai and anti-Gallai graphs
The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study ...
متن کاملSome uses of spectral methods
Methods based on the analysis of eigenvalues or singular values of a matrix, often called spectral methods are very popular for many applications including graph partitioning, clustering, recognition, compression. This paper will survey some of these applications and present the basic underlying ideas.
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1504.00616 شماره
صفحات -
تاریخ انتشار 2015